Evolving scheduling rules with gene expression programming for dynamic single-machine scheduling problems
نویسندگان
چکیده
The paper considers the problems of scheduling n jobs that are released over time on a machine in order to optimize one or more objectives. The problems are dynamic single-machine scheduling problems (DSMSPs) with job release dates and needed to be solved urgently because they exist widely in practical production environment. Gene expression programming-based scheduling rules constructor (GEPSRC) was proposed to construct effective scheduling rules (SRs) for DSMSPs with job release dates automatically. In GEPSRC, Gene Expression Programming (GEP) worked as a heuristic search to search the space of SRs. Many experiments were conducted, and comparisons were made between GEPSRC and some previous methods. The results showed that GEPSRC achieved significant improvement.
منابع مشابه
A Mathematical Programming Model and Genetic Algorithm for a Multi-Product Single Machine Scheduling Problem with Rework Processes
In this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem. Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...
متن کاملNet Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
متن کاملNet Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009